Expressive Power of Safe First-Order Logical Decision Trees
نویسندگان
چکیده
This paper characterizes the expressive power of a subclass of first-order logical decision trees (FOLDTs) as a fragment of firstorder logic. Specifically, using safe FOLDTs one can express precisely the boolean combinations of safe existential sentences.
منابع مشابه
On the Expressive Power of Modal Logics on Trees
Various logical languages are compared regarding their expressive power with respect to models consisting of nitely bounded branching in nite trees The basic multimodal logic with backward and forward necessity operators is equivalent to restricted rst order logic by adding the binary temporal operators since and until we get the expressive power of rst order logic on trees Hence restricted pro...
متن کاملGuarded Second-Order Logic, Spanning Trees, and Network Flows
According to a theorem of Courcelle monadic second-order logic and guarded second-order logic (where one can also quantify over sets of edges) have the same expressive power over the class of all countable k-sparse hypergraphs. In the first part of the present paper we extend this result to hypergraphs of arbitrary cardinality. In the second part, we present a generalisation dealing with method...
متن کاملTransforming structures by set interpretations
We consider a new kind of interpretation over relational structures: finite sets interpretations. Those interpretations are defined by weak monadic second-order (WMSO) formulas with free set variables. They transform a given structure into a structure with a domain consisting of finite sets of elements of the orignal structure. The definition of these interpretations directly implies that they ...
متن کاملLogical Definability and Query Languages over Unranked Trees
Unranked trees, that is, trees with no restriction on the number of children of nodes, have recently attracted much attention, primarily as an abstraction of XML documents. In this paper, we study logical definability over unranked trees, as well as collections of unranked trees, that can be viewed as databases of XML documents. The traditional approach to definability is to view each tree as a...
متن کاملDeciding definability in FO2(<h, <v) on trees
We prove that it is decidable whether a regular unranked tree language is definable in FO2(<h, <v). By FO2(<h, <v ) we refer to the two variable fragment of first order logic built from the descendant and following sibling predicates. In terms of expressive power it corresponds to a fragment of the navigational core of XPath that contains modalities for going up to some ancestor, down to some d...
متن کامل